Evaluation of the linear matrix equation solvers in SLICOT
نویسندگان
چکیده
We discuss solvers for Sylvester, Lyapunov, and Stein equations that are available in the SLICOT Library (Subroutine Library In COntrol Theory). These solvers offer improved efficiency, reliability, and functionality compared to corresponding solvers in other computer-aided control system design packages. The performance of the SLICOT solvers is compared with the corresponding MATLAB solvers. This note can also serve as a guide to the SLICOT and SLICOTbased MATLAB solvers for Linear Matrix Equations.
منابع مشابه
Computational Experience in Solving Large Linear Matrix Equations for Automatic Control
State-of-the-art, uni-processor linear matrix equation solvers for automatic control computations are investigated and compared for various problem sizes. Generalpurpose SLICOT solvers are the most efficient ones for small-size problems, but they cannot compete for larger problems with specialized solvers designed for certain problem classes. Copyright c ©2004 IFAC
متن کاملComputational Experience in Solving Linear Matrix Equations for Automatic Control
State-of-the-art, uni-processor linear matrix equation solvers for automatic control computations are investigated and compared for various problem sizes. Generalpurpose SLICOT solvers are the most efficient ones for small-size problems, but they cannot compete for larger problems with specialized solvers designed for certain problem classes. Copyright c 2005 IFAC
متن کاملA new Approximation to the solution of the linear matrix equation AXB = C
It is well-known that the matrix equations play a significant role in several applications in science and engineering. There are various approaches either direct methods or iterative methods to evaluate the solution of these equations. In this research article, the homotopy perturbation method (HPM) will employ to deduce the approximated solution of the linear matrix equation in the form AXB=C....
متن کاملOn the solving of matrix equation of Sylvester type
A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کامل